Learning constraint sub - hierarchies . The Bidirectional Gradual Learning Algorithm ∗
نویسنده
چکیده
It is a common feature of many case marking languages that some but not all objects are case marked. However, it is usually not entirely random which objects are marked and which aren’t. Rather, case marking only applies to a morphologically or semantically well-defined class of NPs. Take Hebrew as an example. In this language, definite objects carry an accusative morpheme while indefinite objects are unmarked.
منابع مشابه
Some Correct Error-driven Versions of the Constraint Demotion Algorithm
This paper shows that Error-Driven Constraint Demotion (EDCD), an errordriven learning algorithm proposed by Tesar (1995) for Prince and Smolensky’s (1993) version of Optimality Theory, can fail to converge to a totally ranked hierarchy of constraints, unlike the earlier non-error-driven learning algorithms proposed by Tesar and Smolensky (1993). The cause of the problem is found in Tesar’s use...
متن کاملRemarks and Replies
This article shows that Error-Driven Constraint Demotion (EDCD), an error-driven learning algorithm proposed by Tesar (1995) for Prince and Smolensky’s (1993/2004) version of Optimality Theory, can fail to converge to a correct totally ranked hierarchy of constraints, unlike the earlier non-error-driven learning algorithms proposed by Tesar and Smolensky (1993). The cause of the problem is foun...
متن کاملEmpirical Tests of the Gradual Learning Algorithm
The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smolensky (1993, 1996, 1998,2000), which initiated the learnability research program for Optimality T...
متن کاملGradual Constraint-Ranking Learning Algorithm Predicts Acquisition Order
We will show that the Gradual Constraint-Ranking Learning Algorithm is capable of modelling attested acquisition orders and learning curves in a realistic manner, thus bridging the gap that used to exist between formal computational learning algorithms and actual acquisition data. Levelt, Schiller, and Levelt (to appear) found that the acquisition order for syllable types for twelve children ac...
متن کاملCorpus-based Learning in Stochastic OT-LFG – Experiments with a Bidirectional Bootstrapping Approach
This paper reports on experiments exploring the application of a Stochastic Optimality-Theoretic approach in the corpus-based learning of some aspects of syntax. Using the Gradual Learning Algorithm, the clausal syntax of German has to be learned from learning instances of clauses extracted from a corpus. The particular focus in the experiments was placed on the usability of a bidirectional app...
متن کامل